Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
نویسندگان
چکیده
Consider a single machine and a set of jobs that are available for processing at time 0. Job has a processing time , a due date and a weight . We consider bi-criteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs. We give NPhardness proofs for the scheduling problems when either one of the two criteria is the primary criterion and the other one is the secondary criterion. These results answer two open questions posed by Lee and Vairaktarakis in 1993. We consider complexity relationships between the various problems, give polynomial-time algorithms for some special cases, and propose fast heuristics for the general case. The effectiveness of the heuristics is measured by empirical study. Our results show that one heuristic performs extremely well compared to optimal solutions.
منابع مشابه
A Survey of Algorithms for Single and Multi-objective Unrelated Parallel-machine Deterministic Scheduling Problems
This paper surveys the literature related to solving traditional unrelated parallel-machine scheduling problems. It compiles algorithms for the makespan, total weighted sum of completion times, maximum tardiness, total tardiness, total earliness and tardiness, and multiple criteria performance measures. The review of the existing algorithms is restricted to the deterministic problems without se...
متن کاملFuzzy bi-criteria scheduling on parallel machines involving weighted flow time and maximum tardiness
Abstract: This paper considers a bi-criteria scheduling on parallel machines in fuzzy environment which optimizes the weighted flow time and maximum tardiness. The fuzziness, vagueness or uncertainty in processing time of jobs is represented by triangular fuzzy membership function. The bi-criteria problem with weighted flow time and maximum tardiness as primary and secondary criteria, respectiv...
متن کاملSingle Machine Scheduling Problems with Time-dependent Learning Effects
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is...
متن کاملSolvable cases of permutation #owshop scheduling with dominating machines
In this paper we study the permutation #owshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the "ve regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these "ve cases are solvable by presenting a polymonial-time s...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 177 شماره
صفحات -
تاریخ انتشار 2007